A Frame Synchronization based on Likelihood-Ratio Threshold of LDPC Decoding

نویسندگان

  • Zhixiong Chen
  • Dongsheng Han
  • Hongyin Xiang
چکیده

A LDPC code-aided frame synchronization algorithm based on likelihood ratio value threshold is proposed and analyzed in this paper. For soft information vectors with different frame offsets, the likelihood ratio value presenting the probability ratio of satisfaction of all check restrictions and dissatisfaction of all check restrictions are computed respectively, and then the point larger than a threshold is chosen as the final frame synchronization bounder. The method to select the threshold is studied theoretically and is analyzed according to simulation result. And Frame synchronization error ratio of new algorithm is derived. Compared to exiting LDPC code-aided frame synchronization algorithm based on maximum LLR, new algorithm saves synchronization searching time. Synchronization performance simulation results of new algorithm are given and analyzed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

On the Iterative Decoding of High-Rate LDPC Codes With Applications in Compressed Sensing

This paper considers the performance of (j, k)regular low-density parity-check (LDPC) codes with messagepassing (MP) decoding algorithms in the high-rate regime. In particular, we derive the high-rate scaling law for MP decoding of LDPC codes on the binary erasure channel (BEC) and the qary symmetric channel (q-SC). For the BEC, the density evolution (DE) threshold of iterative decoding scales ...

متن کامل

And Goto : Sphere Detection Analysis Performance Combined with the Ldpc Decoding

31 Abstract—This paper investigates on the low density parity-check (LDPC) decoding algorithms and the detection methods of the multiple-input multiple-output (MIMO) systems. For LDPC codes, min-sum and layered decoding algorithms are discussed, and for MIMO detection, the maximum likelihood (ML) decision based on the sphere decoding algorithm is mainly analyzed. Also, the performance of the co...

متن کامل

Joint Channel Coding based on LDPC Codes with Gaussian Kernel Reflecton and CS Redundancy

This paper proposes a new joint decoding algorithm frame based on compressed sensing CS and LDPC (Low-Density Parity-Check) codes. Redundant information can be effectively extracted and amplified by CS reconstruction as a compensation to correct decoding of LDPC codes. We adopt Gaussian kernel function of image segmentation as a reflection. Simulation results indicate, compared with LDPC algori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013